Spectral analogues of Erdős’ and Moon-Moser’s theorems on Hamilton cycles
نویسندگان
چکیده
In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper we present the spectral analogues of Erdős’ theorem and Moon-Moser’s theorem, respectively. Let Gk n be the class of non-Hamiltonian graphs of order n and minimum degree at least k. We determine the maximum (signless Laplacian) spectral radius of graphs in Gk n (for large enough n), and the minimum (signless Laplacian) spectral radius of the complements of graphs in Gk n. All extremal graphs with the maximum (signless Laplacian) spectral radius and with the minimum (signless Laplacian) spectral radius of the complements are determined, respectively. We also solve similar problems for balanced bipartite graphs and the quasi-complements.
منابع مشابه
ON THE SPECTRAL BEHAVIOR-OF DEUTERIO ANALOGUES OF SOME CAFtBOXYLIC ACIDS IN HEAVY WATER AND CORRELATION BETWEEN THEIR CARBONYL STRETCHING FREQUENCIES AND THEIR ACIDIC STRENGTHS AT INFINITE DILUTION
Infrared spectra of some deuterio analogues of carboxylic acids in heavy water have been investigated and their spectral behavior in carbonyl stretching frequency region have been interpreted in terms of their structural behavior in aqueous solutions. It has been shown that a linear relationship exists between carbonyl stretching frequency of solvated acids at infinite dilution and their...
متن کاملMaximal Independent Sets and Separating Covers
In 1973, Katona raised the problem of determining the maximum number of subsets in a separating cover on n elements. The answer to Katona’s question turns out to be the inverse to the answer to a much simpler question: what is the largest integer which is the product of positive integers with sum n? We give a combinatorial explanation for this relationship, via Moon and Moser’s answer to a ques...
متن کاملTHE p–ADIC ORDER OF POWER SUMS, THE ERDŐS –MOSER EQUATION, AND BERNOULLI NUMBERS
The Erdős–Moser equation is a Diophantine equation proposed more than 60 years ago which remains unresolved to this day. In this paper, we consider the problem in terms of divisibility of power sums and in terms of certain Egyptian fraction equations. As a consequence, we show that solutions must satisfy strong divisibility properties and a restrictive Egyptian fraction equation. Our studies le...
متن کاملSymplectic Geometry
1 Symplectic Manifolds 5 1.1 Symplectic Linear Algebra . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 Symplectic Forms . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3 Cotangent Bundles . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.4 Moser’s Trick . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.5 Darboux and Moser Theorems . . . . . . . . . . . . . . . ....
متن کامل